On a coupled Kadomtsev–Petviashvili system associated with an elliptic curve

نویسندگان

چکیده

The coupled Kadomtsev–Petviashvili system associated with an elliptic curve, proposed by Date, Jimbo, and Miwa [J. Phys. Soc. Jpn., 52:766–771, 1983], is reinvestigated within the direct linearization framework, which provides us more insights into integrability of this model from perspective a general linear integral equation. As result, we successfully construct for not only Lax pair composed differential operators in 2 × matrix form but also multisoliton solutions phases parametrized points on curve. Dimensional reductions based linearization, to Korteweg–de Vries Boussinesq systems, are discussed. In addition, novel class obtained D ∞ $D_\infty$ -type equation nonzero constant background as by-product.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A∞-structures on an Elliptic Curve

Let E be an elliptic curve over a field k. Let us denote by Vect(E) the category of algebraic vector bundles on E, where as space of morphisms from V1 to V2 we take the graded space Hom(V1, V2)⊕Ext (V1, V2) with the natural composition law. In this paper we study extensions of this (strictly associative) composition to A∞-structures on Vect(E) (see section 1 for the definition). The motivation ...

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

An MDS code associated to an elliptic curve

We will construct an MDS(= the most distance separable) code C which admits a decomposition C = ⊕iCi such that every factor is still MDS. An effective way of decoding will be also discussed.

متن کامل

Explicit 4-descents on an Elliptic Curve

It is shown that the obvious method of descending from an element of the 2-Selmer group of an elliptic curve, E, will indeed give elements of order 1, 2 or 4 in the Weil-Chatelet group of E. Explicit algorithms for such a method are given.

متن کامل

A Review on Distributed System Security using Elliptic Curve Cryptography

Most of the security architecture uses public key cryptosystems for authentication and to secure the communication that takes place on distributes sites. Now a day’s identity based cryptography and certificate-less public key cryptography are used for enhancing the security. Certificate-less based cryptography has reduced the certificate necessity for key distribution and reducing the problem o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Studies in Applied Mathematics

سال: 2022

ISSN: ['0022-2526', '1467-9590']

DOI: https://doi.org/10.1111/sapm.12529